Normal Boolean functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On construction of non-normal Boolean functions

Given two non-weakly k-normal Boolean functions on n variables a method is proposed to construct a non-weakly (k + 1)-normal Boolean function on (n + 2)variables.

متن کامل

Composition of Post classes and normal forms of Boolean functions

The class composition C ◦ K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f ∈ C, g1, . . . , gn ∈ K, is investigated. This composition C ◦K is either the join C ∨K in the Post Lattice or it is not a clone, and all pairs of clones C,K are classified accordingly. Factorizations of the clone Ω of all Boolean functions as a composition of minimal clones are describe...

متن کامل

Most Complex Boolean Functions Detected by the Specialized Normal Form

It is well known that Exclusive Sum-Of-Products (ESOP) expressions for Boolean functions require on average the smallest number of cubes. Thus, a simple complexity measure for a Boolean function is the number of cubes in its simplest ESOP. It will be shown that this structure-oriented measure of the complexity can be improved by a unique complexity measure which is based on the function. Thus, ...

متن کامل

Boolean Functions

Written by prominent experts in the field, this monograph provides the first comprehensive and unified presentation of the structural, algorithmic, and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. It presentswithin this framework the fundamental elements...

متن کامل

Locally monotone Boolean and pseudo-Boolean functions

We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 2004

ISSN: 0885-064X

DOI: 10.1016/j.jco.2003.08.010